Inf-semilattice Approach to Self-dual Morphology Inf-semilattice Approach to Self-dual Morphology

نویسندگان

  • R. Keshet
  • Renato Keshet
چکیده

Today, the theoretical framework of mathematical morphology is phrased in terms of complete lattices and operators de ned on them. That means in particular that the choice of the underlying partial ordering is of eminent importance, as it determines the class of morphological operators that one ends up with. The duality principle for partially ordered sets, which says that the opposite of a partial ordering is also a partial ordering, gives rise to the fact that all morphological operators occur in pairs, e.g., dilation and erosion, opening and closing, etc. This phenomenon often prohibits the construction of tools that treat foreground and background of signals in exactly the same way. In this paper we discuss an alternative framework for morphological image processing that gives rise to image operators which are intrinsically self-dual. As one might expect, this alternative framework is entirely based upon the de nition of a new self-dual partial ordering. 2000 Mathematics Subject Classi cation: 68U10, 06A12, 06B23, 06F15

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self-dual morphology on tree semilattices and applications

We present a new tree-based framework for producing self-dual morphological operators. For any given tree representation of images, one can associate a complete inf-semilattice (CISL) in the corresponding tree-representation domain, where the operators can then be derived. We also present a particular case of this general framework, involving a new tree representation, the ExtremaWatershed Tree...

متن کامل

Sparsely Connected Semilattice Associative Memories on Certain L-Fuzzy Sets

In mathematical morphology (MM), images are viewed as L-fuzzy sets, where the symbol L stands for a complete lattice. In particular, fuzzy MM arises by considering L = [0, 1]. Mathematical morphology provides the theoretical basis for certain lattice computing models called morphological neural networks (MNNs) including morphological associative memories (MAMs) that are the focus of this paper....

متن کامل

A general framework for tree-based morphology and its applications to self-dual filtering

This paper presents a tree-based framework for producing self-dual morphological operators, based on a tree-representation complete inf-semilattice (CISL). The idea is to use a self-dual tree transform to map a given image into the above CISL, perform one or more morphological operations there, and map the result back to the image domain using the inverse tree transform. We also present a parti...

متن کامل

On Heyting algebras and dual BCK-algebras

A Heyting algebra is a distributive lattice with implication and a dual $BCK$-algebra is an algebraic system having as models logical systems equipped with implication. The aim of this paper is to investigate the relation of Heyting algebras between dual $BCK$-algebras. We define notions of $i$-invariant and $m$-invariant on dual $BCK$-semilattices and prove that a Heyting semilattice is equiva...

متن کامل

Lawson Topology in Continuous Lattices

Let S, T be semilattices. Let us assume that if S is upper-bounded, then T is upper-bounded. A map from S into T is said to be a semilattice morphism from S into T if: (Def. 1) For every finite subset X of S holds it preserves inf of X. Let S, T be semilattices. One can check that every map from S into T which is meet-preserving is also monotone. Let S be a semilattice and let T be an upper-bou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001